//路径不同
class Solution {
        
        public:
            int uniquePaths(int m, int n) {
                        vector< vector<int>>path(m, vector<int>(n));
                                path[0][0]=1;
                                        for (int i=0;i<m;i++)
                                                {
                                                                for (int j=0;j<n;j++)
                                                                            {
                                                                                                if(i>0)path[i][j]+=path[i-1][j];
                                                                                                                if (j>0)path[i][j]+=path[i][j-1];
                                                                            }
                                                }
                                                        return path[m-1][n-1];
            }
};
                                                                            }
                                                }
            }
}